On the Relations Between SINR Diagrams and Voronoi Diagrams
نویسندگان
چکیده
In this review, we illustrate the relations between wireless communication and computational geometry. As a concrete example, we consider a fundamental geometric object from each field: SINR diagrams and Voronoi diagrams. We discuss the relations between these representations, which appear in several distinct settings of wireless communication, as well as some algorithmic applications.
منابع مشابه
Nonuniform SINR+Voroni Diagrams Are Effectively Uniform
This paper concerns the behavior of an SINR diagram of wireless systems, composed of a set S of n stations embedded in R, when restricted to the corresponding Voronoi diagram imposed on S. The diagram obtained by restricting the SINR zones to their corresponding Voronoi cells is referred to hereafter as an SINR+Voronoi diagram. The study of SINR+Voronoi diagrams is motivated by the following tw...
متن کاملOn the conversion of ordinary voronoi diagrams into laguerre diagrams
We present some geometric relationships between the ordinary Voronoi diagram, and the Voronoi diagram in the Laguerre geometry. We derive from these properties an algorithm for the conversion of ordinary Voronoi diagrams into Voronoi diagrams in the Laguerre geometry.
متن کاملBregman Voronoi Diagrams: Properties, Algorithms and Applications
The Voronoi diagram of a finite set of objects is a fundamental geometric structure that subdivides the embedding space into regions, each region consisting of the points that are closer to a given object than to the others. We may define many variants of Voronoi diagrams depending on the class of objects, the distance functions and the embedding space. In this paper, we investigate a framework...
متن کاملGeodesic Voronoi Diagrams on Parametric Surfaces
In this paper we will extend the concept of Voronoi diagrams to parameterized surfuces where distance between two points is defined as infimum over the lengths of surface paths connecting these points. We will present a method to compute Voronoi diagrams on these surfuces.
متن کاملVoronoi Diagrams in Linear Time ∗
Voronoi diagrams are a well-studied data structure of proximity information, and although most cases require Ω(n log n) construction time, it is interesting and useful to develop linear-time algorithms for certain Voronoi diagrams. We develop a linear-time algorithm for abstract Voronoi diagrams in a domain where each site has a unique face and no pair of bisectors intersect outside the domain....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015